PCBDDC: A Class of Robust Dual-Primal Methods in PETSc
نویسندگان
چکیده
منابع مشابه
Primal-dual interior-point methods
3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...
متن کاملProximal Primal-Dual Optimization Methods
In the field of inverse problems, one of the main benefits which can be drawn from primal-dual optimization approaches is that they do not require any linear operator inversion. In addition, they allow to split a convex objective function in a sum of simpler terms which can be dealt with individually either through their proximity operator or through their gradient if they correspond to smooth ...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملPrimal-dual first-order methods for a class of cone programming
In this paper we study primal-dual first-order methods for a class of cone programming problems. In particular, we first present four natural primal-dual smooth convex minimization reformulations for them, and then discuss first-order methods, especially a variant of Nesterov’s smooth (VNS) method [2] for solving these reformulations. The associated worst-case major arithmetic operation costs o...
متن کاملOptimal Primal-Dual Methods for a Class of Saddle Point Problems
We present a novel accelerated primal-dual (APD) method for solving a class of deterministic and stochastic saddle point problems (SPP). The basic idea of this algorithm is to incorporate a multi-step acceleration scheme into the primaldual method without smoothing the objective function. For deterministic SPP, the APD method achieves the same optimal rate of convergence as Nesterov’s smoothing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2016
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1025785